Semifinite Harmonic Functions on the Gnedin–Kingman Graph

نویسندگان

چکیده

We study the Gnedin–Kingman graph, which corresponds to Pieri’s rule for monomial basis {Mλ} in algebra QSym of quasisymmetric functions. The paper contains a detailed announcement results concerning classification indecomposable semifinite harmonic functions on graph. For these functions, we also establish multiplicativity property, is an analog Vershik–Kerov ring theorem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

on the harmonic index of graph operations

‎the harmonic index of a connected graph $g$‎, ‎denoted by $h(g)$‎, ‎is‎ ‎defined as $h(g)=sum_{uvin e(g)}frac{2}{d_u+d_v}$‎ ‎where $d_v$ is the degree of a vertex $v$ in g‎. ‎in this paper‎, ‎expressions for the harary indices of the‎ ‎join‎, ‎corona product‎, ‎cartesian product‎, ‎composition and symmetric difference of graphs are‎ ‎derived‎.

متن کامل

Semifinite Spectral Triples Associated with Graph C-algebras

We review the recent construction of semifinite spectral triples for graph C∗algebras. These examples have inspired many other developments and we review some of these such as the relation between the semifinite index and the Kasparov product, examples of noncommutative manifolds, and an index theorem in twisted cyclic theory using a KMS state. Alan L. Carey Mathematical Sciences Institute Aust...

متن کامل

On Univalent Harmonic Functions

Two classes of univalent harmonic functions on unit disc satisfying the conditions ∑∞ n=2(n−α)(|an|+|bn|) ≤ (1−α)(1−|b1|) and ∑∞ n=2 n(n−α)(|an|+|bn|) ≤ (1−α)(1−|b1|) are given. That the ranges of the functions belonging to these two classes are starlike and convex, respectively. Sharp coefficient relations and distortion theorems are given for these functions. Furthermore results concerning th...

متن کامل

On Harmonic Functions on Trees

By a tree T we mean a connected graph such that every subgraph obtained from T by removing any of its edges is not connected. In what follows we will only consider trees in which we distinguish a vertex v0 as an origin. As usual we denote by V and E the set of vertices and the set of edges (respectively) of the tree. If v and w are the boundary vertices of an edge, we say that they are neighbou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Sciences

سال: 2021

ISSN: ['1072-3374', '1573-8795']

DOI: https://doi.org/10.1007/s10958-021-05356-9